Evolving Generalized Euclidean Distances for Training RBNN
نویسندگان
چکیده
In Radial Basis Neural Networks (RBNN), the activation of each neuron depends on the Euclidean distance between a pattern and the neuron center. Such a symmetrical activation assumes that all attributes are equally relevant, which might not be true. Non-symmetrical distances like Mahalanobis can be used. However, this distance is computed directly from the data covariance matrix and therefore the accuracy of the learning algorithm is not taken into account. In this paper, we propose to use a Genetic Algorithm to search for a generalized Euclidean distance matrix, that minimizes the error produced by a RBNN.
منابع مشابه
Using a Mahalanobis-Like Distance to Train Radial Basis Neural Networks
Radial Basis Neural Networks (RBNN) can approximate any regular function and have a faster training phase than other similar neural networks. However, the activation of each neuron depends on the euclidean distance between a pattern and the neuron center. Therefore, the activation function is symmetrical and all attributes are considered equally relevant. This could be solved by altering the me...
متن کاملOn the Generalization of the MDS Method
The Multi-Dimensional Scaling (MDS) method is used in statistics to detect hidden interrelations among multi-dimensional data and it has a wide range of applications. The method’s input is a matrix that describes the similarity/dissimilarity among objects of unknown dimension. The objects are generally reconstructed as points of a lower dimensional space to reveal the geometric configuration of...
متن کاملOn approximating Euclidean metrics by digital distances in 2D and 3D
In this paper a geometric approach is suggested to ®nd the closest approximation to Euclidean metric based on geometric measures of the digital circles in 2D and the digital spheres in 3D for the generalized octagonal distances. First we show that the vertices of the digital circles (spheres) for octagonal distances can be suitably approximated as a function of the number of neighborhood types ...
متن کاملZero-error dissimilarity based classifiers
We consider general non-Euclidean distance measures between real world objects that need to be classified. It is assumed that objects are represented by distances to other objects only. Conditions for zero-error dissimilarity based classifiers are derived. Additional conditions are given under which the zero-error decision boundary is a continues function of the distances to a finite set of tra...
متن کاملNURBS Surface Reconstruction Using Rational B-spline Neural Networks
Surface reconstruction is a very challenging step in Reverse Engineering. It generates a surface from point cloud acquired from a part surface. NURBS surfaces are commonly used for freeform surface reconstruction. There are several algorithms of NURBS surface reconstruction including: Least Squares Methods, simulated annealing, and particle swarm optimization. The major problem of these methods...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers and Artificial Intelligence
دوره 26 شماره
صفحات -
تاریخ انتشار 2007